Walsh transform - определение. Что такое Walsh transform
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

Что (кто) такое Walsh transform - определение

EXAMPLE OF A GENERALIZED CLASS OF FOURIER TRANSFORMS
Hadamard transformation; Hadamard gate; Walsh-Hadamard Transform; Walsh-Hadamard transform; Hadamard Transform; Walsh transform; Walsh-Fourier transform; Hadamard-Rademacher-Walsh transform; Walsh–Hadamard transform
  • [[Fast Walsh–Hadamard transform]], a faster way to calculate the Walsh spectrum of (1, 0, 1, 0, 0, 1, 1, 0).
  • The original function can be expressed by means of its Walsh spectrum as an arithmetical polynomial.
  •  last2 = Thornton }}</ref><br>(1, 0, 1, 0, 0, 1, 1, 0) × H(8) = (4, 2, 0, −2, 0, 2, 0, 2)

Hadamard transform         
The Hadamard transform (also known as the Walsh–Hadamard transform, Hadamard–Rademacher–Walsh transform, Walsh transform, or Walsh–Fourier transform) is an example of a generalized class of Fourier transforms. It performs an orthogonal, symmetric, involutive, linear operation on real numbers (or complex, or hypercomplex numbers, although the Hadamard matrices themselves are purely real).
Fast Walsh–Hadamard transform         
DIVIDE AND CONQUER ALGORITHM TO COMPUTE A HADAMARD TRANSFORM
FWHT; Fast Hadamard transform; Fast Walsh transform; Fast Walsh-Hadamard transform
In computational mathematics, the Hadamard ordered fast Walsh–Hadamard transform (FWHTh) is an efficient algorithm to compute the Walsh–Hadamard transform (WHT). A naive implementation of the WHT of order n = 2^m would have a computational complexity of O(n^2).
Z-transform         
MATHEMATICAL TRANSFORM WHICH CONVERTS SIGNALS FROM THE TIME DOMAIN TO THE FREQUENCY DOMAIN
Z transform; Laurent transform; Bilateral Z-transform; Bilateral z-transform; Z Transform; Z-domain; Z-transformation
In mathematics and signal processing, the Z-transform converts a discrete-time signal, which is a sequence of real or complex numbers, into a complex frequency-domain (z-domain or z-plane) representation.

Википедия

Hadamard transform

The Hadamard transform (also known as the Walsh–Hadamard transform, Hadamard–Rademacher–Walsh transform, Walsh transform, or Walsh–Fourier transform) is an example of a generalized class of Fourier transforms. It performs an orthogonal, symmetric, involutive, linear operation on 2m real numbers (or complex, or hypercomplex numbers, although the Hadamard matrices themselves are purely real).

The Hadamard transform can be regarded as being built out of size-2 discrete Fourier transforms (DFTs), and is in fact equivalent to a multidimensional DFT of size 2 × 2 × ⋯ × 2 × 2. It decomposes an arbitrary input vector into a superposition of Walsh functions.

The transform is named for the French mathematician Jacques Hadamard (French: [adamaʁ]), the German-American mathematician Hans Rademacher, and the American mathematician Joseph L. Walsh.